A computable absolutely normal Liouville number
نویسندگان
چکیده
منابع مشابه
A computable absolutely normal Liouville number
We give an algorithm that computes an absolutely normal Liouville number. 1. The main result The set of Liouville numbers is {x ∈ R \Q : ∀k ∈ N, ∃q ∈ N, q > 1 and ||qx|| < q−k} where ||x|| = min{|x−m| : m ∈ Z} is the distance of a real number x to the nearest integer and other notation is as usual. Liouville’s constant, ∑ k≥1 10 −k!, is the standard example of a Liouville number. Though uncount...
متن کاملAn example of a computable absolutely normal number
The first example of an absolutely normal number was given by Sierpinski in 1916, twenty years before the concept of computability was formalized. In this note we give a recursive reformulation of Sierpinski’s construction which produces a computable absolutely normal number.
متن کاملAn example of a computable absolutely normal number Ver ' onica Becher
The 2rst example of an absolutely normal number was given by Sierpinski in 1916, twenty years before the concept of computability was formalized. In this note we give a recursive reformulation of Sierpinski’s construction which produces a computable absolutely normal number. c © 2002 Elsevier Science B.V. All rights reserved.
متن کاملGauge Invariant Computable Quantities In Timelike Liouville Theory
Timelike Liouville theory admits the sphere S as a real saddle point, about which quantum fluctuations can occur. An issue occurs when computing the expectation values of specific types of quantities, like the distance between points. The problem being that the gauge redundancy of the path integral over metrics is not completely fixed even after fixing to conformal gauge by imposing gμν = e g̃μν...
متن کاملA polynomial-time algorithm for computing absolutely normal numbers
We give an algorithm to compute an absolutely normal number so that the first i digits in its binary expansion are obtained in time polynomial in i; in fact, just above quadratic. The algorithm uses combinatorial tools to control divergence from normality. Speed of computation is achieved at the sacrifice of speed of convergence to normality.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematics of Computation
سال: 2015
ISSN: 0025-5718,1088-6842
DOI: 10.1090/mcom/2964